An Approximate Maximum Likelihood Approach, Applied to Phylogenetic Trees

نویسندگان

  • Henrik Jönsson
  • Bo Söderberg
چکیده

A novel type of approximation scheme to the maximum likelihood (ML) approach is presented and discussed in the context of phylogenetic tree reconstruction from aligned DNA sequences. It is based on a parameterized approximation to the conditional distribution of hidden variables (related, e.g., to the sequences of unobserved branch point ancestors) given the observed data. A modified likelihood, based on the extended data, is then maximized with respect to the parameters of the model as well as to those involved in the approximation. With a suitable form of the approximation, the proposed method allows for simpler updating of the parameters, at the cost of an increased parameter count and a slight decrease in performance. The method is tested on phylogenetic tree reconstruction from artificially generated sequences, and its performance is compared to that of ML, showing that the approach is competitive for reasonably similar sequences. The method is also applied to real DNA sequences from primates, yielding a result consistent with those obtained by other standard algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theoretical Basis of Likelihood Methods in Molecular Phylogenetic Inference

Phylogenetic inference for molecular data by the maximum-likelihood approach has been attacked from a theoretical point of view, because the likelihood functions take different forms for different trees, so that optimised likelihood values for different trees do not appear directly comparable (Nei, 1987). Here, a new "super-tree" perspective is introduced to refute these criticisms. A super-tre...

متن کامل

DendroBLAST: Approximate Phylogenetic Trees in the Absence of Multiple Sequence Alignments

The rapidly growing availability of genome information has created considerable demand for both fast and accurate phylogenetic inference algorithms. We present a novel method called DendroBLAST for reconstructing phylogenetic dendrograms/trees from protein sequences using BLAST. This method differs from other methods by incorporating a simple model of sequence evolution to test the effect of in...

متن کامل

Enclosing the Maximum Likelihood of the Simplest DNA Model Evolving on Fixed Topologies: Towards a Rigorous Framework for Phylogenetic Inference

An interval extension of the recursive formulation for the likelihood function of the simplest Markov model of DNA evolution on unrooted phylogenetic trees with a fixed topology is used to obtain rigorous enclosure(s) of the global maximum likelihood. Validated global maximizer(s) inside any compact set of the parameter space which is the set of all branch lengths of the tree are thus obtained....

متن کامل

Study on phylogenetic status of Hari barbel Luciobarbus conocephalus (Kessler, 1872) from Hari river using Cytb gene

Recently, Luciobarbus conocephalus from the Hari River was reported for the first time, but there is doubt about the validity of this species between authors, because some of them placed it as a subspecies or synonym of L. capito. Therefore, the present study was conducted to investigate the status of phylogeny and the validity of this species. For this purpose, specimens captured from Hari Riv...

متن کامل

Ultrafast Approximation for Phylogenetic Bootstrap

Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and the Shimodaira-Hasegawa-like approximate likelihood ratio test have been introduced to speed up t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of computational biology : a journal of computational molecular cell biology

دوره 10 5  شماره 

صفحات  -

تاریخ انتشار 2003